Every Iterated Morphism Yields a co-CFL

نویسنده

  • Jean Berstel
چکیده

Recently, Main [3] and Main, Bucher and Haussler [4] disproved quite a lot of conjectures about various classes of context-free languages by showing that the complement of the set of left factors of the T h u e M o r s e sequence and of other related infinite words is context-free. The aim of this article is to extend the latter result by showing, with almost the same proof technique, that, for any i terated morphism, the complement of the set of left factors of an infinite word it generates is context-free. It appears in the construction that the language is even one-counter (in the sense of Gre ibach [2]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

No iterated morphism generates any Arshon sequence of odd order

We show that no Arshon sequence of odd order can be generated by an iterated morphism. This solves a problem of Kitaev and generalizes results of Berstel and of Kitaev.

متن کامل

Two-dimensional iterated morphisms and discrete planes

Iterated morphisms of the free monoid are very simple combinatorial objects which produce in nite sequences by replacing iteratively letters by words. The aim of this paper is to introduce a formalism for a notion of two-dimensional morphisms; we show that they can be iterated by using local rules, and that they generate two-dimensional patterns related to discrete approximations of irrational ...

متن کامل

Descent for Discrete (Co)fibrations

We characterize the (effective) E-descent morphisms in the category Cat of small categories, when E is the class of discrete fibrations or the one of discrete cofibrations, and prove that every effective global-descent morphism is an effective E-descent morphism while its converse fails.

متن کامل

On the Asymptotic Abelian Complexity of Morphic Words

The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...

متن کامل

A periodicity property of iterated morphisms

Suppose f : X∗ −→ X∗ is a morphism and u, v ∈ X∗. For every nonnegative integer n, let zn be the longest common prefix of f(u) and f(v), and let un, vn ∈ X∗ be words such that f(u) = znun and f(v) = znvn. We prove that there is a positive integer q such that for any positive integer p, the prefixes of un (resp. vn) of length p form an ultimately periodic sequence having period q. Further, there...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 1986